Comparing Transition Systems with Independence and Asynchronous Transition Systems
نویسندگان
چکیده
Transition systems with independence and asynchronous transition systems are noninterleaving models for concurrency arising from the same simple idea of decorating transitions with events. They differ for the choice of a derived versus a primitive notion of event which induces considerable differences and makes the two models suitable for different purposes. This opens the problem of investigating their mutual relationships, to which this paper gives a fully comprehensive answer. In details, we characterise the category of extensional asynchronous transitions systems as the largest full subcategory of the category of (labelled) asynchronous transition systems which admits TSI, the category of transition systems with independence, as a coreflective subcategory. In addition, we introduce event-maximal asynchronous transitions systems and we show that their category is equivalent to TSI, so providing an exhaustive characterisation of transition systems with independence in terms of asynchronous transition systems.
منابع مشابه
Comparing Transition Systems with Independenceand Asynchronous Transition
Transition systems with independence and asynchronous transition systems are noninterleaving models for concurrency arising from the same simple idea of decorating transitions with events. They diier for the choice of a derived versus a primitive notion of event which induces considerable diierences and makes the two models suitable for diierent purposes. This opens the problem of investigating...
متن کاملTransition systems with independence and multi-arcs
We extend the model of transition systems with independence in order to provide it with a feature relevant in the noninterleaving analysis of concurrent systems, namely multi-arcs. Moreover, we study the relationships between the category of transition systems with independence and multi-arcs and the category of labeled asynchronous transition systems, extending the results recently obtained by...
متن کاملUniversit at Augsburg Concurrent Implementation of Asynchronous Transition Systems Concurrent Implementation of Asynchronous Transition Systems
The synthesis problem is to decide for a deterministic transition system whether a Petri net with an isomorphic reachability graph exists and in case to nd such a net (which must have the arc-labels of the transition system as transitions). In this paper, we weaken isomorphism to some form of bisimilarity that also takes concurrency into account and we consider safe nets that may have additiona...
متن کاملGeneralized Asynchronous Systems
The paper is devoted to a mathematical model of concurrency the special case of which is asynchronous system. Distributed asyn-chronous automata are introduced here. It is proved that the Petri nets and transition systems with independence can be considered like the distributed asynchronous automata. Time distributed asynchronous automata are defined in standard way by the map which assigns tim...
متن کاملCCS , Locations and Asynchronous Transition
Our aim is to provide a simple non-interleaved operational semantics for CCS in terms of a model that is easy to understand|asynchronous transition systems. Our approach is guided by the requirement that the semantics should identify the concurrency present in the system in a natural way, in terms of events occurring at independent locations in the system. We extend the standard interleaving tr...
متن کامل